Computational Properties of Boolean Networks
نویسنده
چکیده
Thi s paper considers computa tional characteristics of boolean automata networks with rand om interconnections. The subjects of interest are: th e number of stationary points, the convergence of th e dynamic flow to th ese points, compactness of the at tract ion basins, number of logical switchings during the run , and informational content of the phase portrait. For a special class of uniform diluted nets, these quantities are found to depend basically on two integrated characterist ics of network elements .
منابع مشابه
Simulating Large Random Boolean Networks
The Kauffman N -K, or random boolean network, model is an important tool for exploring the properties of large scale complex systems. There are computational challenges in simulating large networks with high connectivities. We describe some high-performance data structures and algorithms for implementing large-scale simulations of the random boolean network model using various storage types pro...
متن کاملBoolean Models of Genomic Regulatory Networks: Reduction Mappings, Inference, and External Control
Computational modeling of genomic regulation has become an important focus of systems biology and genomic signal processing for the past several years. It holds the promise to uncover both the structure and dynamical properties of the complex gene, protein or metabolic networks responsible for the cell functioning in various contexts and regimes. This, in turn, will lead to the development of o...
متن کاملFrom Boolean to Probabilistic Boolean Networks as Models of Genetic Regulatory Networks
Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles governing biological systems in an integrative and holistic manner. It also paves the way toward the development of systematic approaches for effective therapeutic intervention in disease. The central theme in this paper is the Boolean formalism as a building block for modeling ...
متن کاملOn canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملComputational Capabilities of Random Automata Networks for Reservoir Computing
This paper underscores the conjecture that intrinsic computation is maximal in systems at the "edge of chaos". We study the relationship between dynamics and computational capability in random Boolean networks (RBN) for reservoir computing (RC). RC is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component (called the reservoir) that is pertur...
متن کاملA Computational Model for Simulating Continuous Time Boolean Networks
Random Boolean networks are among the most popular model systems used for modelling the gene regulatory networks due to their answering of the many biological questions in a realistic way, insights into the overall behavior of large genetic networks and suitability for inference. However, discrete time Boolean networks have serious limitations in simulating non-repeating complex dynamic systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 8 شماره
صفحات -
تاریخ انتشار 1994